Analyzing FD Inference in Relational Databases
نویسندگان
چکیده
Imprecise inference models the ability to infer sets of values or information chunks. Imprecise database inference is just as important as precise inference. In fact, it is more prevalent than its precise counterpart even in precise databases. Analyzing the extent of imprecise inference is important in knowledge discovery and database security. Imprecise inference analysis can be used to \mine" rule-based knowledge from database data. In database security, imprecise inference analysis can help determine whether or not a system is safe from imprecise inference attacks. This paper deals with the general problem of analyzing fuzzy inference based on functional dependencies (FDs) in database relations. Fuzzy inference, the ability to infer fuzzy set values, generalizes imprecise (set-valued) inference and precise inference. Likewise, fuzzy relational databases generalize their classical and imprecise counterparts by supporting fuzzy information storage and retrieval. Inference analysis is performed using a special abstract model which maintains vital links to classical, imprecise and fuzzy relational database models. These links increase the utility of the inference formalism in practical applications involving \catalytic inference analysis," including knowledge discovery and database security control.
منابع مشابه
Catalyzing Database Inference with Fuzzy Relations
Inference analysis plays a major role in database security and knowledge discovery. Common sense knowledge, typically expressed in imprecise or fuzzy terms, can be introduced as catalytic relations to existing databases. Analyzing the augmented databases materializes new rules and latent compromising inference channels based on common knowledge and existing database data. This paper shows how f...
متن کاملReverse Engineering of Relational Databases to Ontologies: An Approach Based on an Analysis of HTML Forms
We propose a novel approach to reverse engineering of relational databases to ontologies. Our approach is based on the idea that semantics of a relational database can be inferred, without an explicit analysis of relational schema, tuples and user queries. Rather, these semantics can be extracted by analyzing HTML forms, which are the most popular interface to communicate with relational databa...
متن کاملA Practical Formalism for Imprecise Inference Control
This paper describes a powerful, yet practical, formalism for modeling and controlling imprecise FD-based inference in relational database systems. The formalism provides a canonical representation of inference which uniies precise inference and the primitive imprecise inference mechanisms of abduction and partial deduction. Whereas other imprecise (partial) inference models estimate the probab...
متن کاملLifted Inference in Probabilistic Databases
Probabilistic Databases (PDBs) extend traditional relational databases by annotating each record with a weight, or a probability. Although PDBs define a very simple probability space, by simply adding constraints one can model much richer probability spaces, such as those represented by Markov Logic Networks or other Statistical Relational Models. While in traditional databases query evaluation...
متن کاملSearchable Encrypted Relational Databases: Risks and Countermeasures
We point out the risks of protecting relational databases via Searchable Symmetric Encryption (SSE) schemes by proposing an inference attack exploiting the structural properties of relational databases. We show that record-injection attacks mounted on relational databases have worse consequences than their file-injection counterparts on unstructured databases. Moreover, we discuss some techniqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Data Knowl. Eng.
دوره 18 شماره
صفحات -
تاریخ انتشار 1996